Fast and Memory-Efficient Voronoi Diagram Construction on Triangle Meshes
نویسندگان
چکیده
Supplemental Materials Yipeng Qin Hongchuan Yu Jianjun Zhang National Centre for Computer Animation, Bournemouth University, UK 1 RWR Performance Verification To verify that the proposed RWR procedure effectively reduces memory cost, this section compares memory costs against nearest distance dmin(wn) of the wavefront between two variants of the Voronoi diagram construction: with and without RWR. In this part, the results on 8 other models with various resolutions are shown in addition to the two models (Armadillo and Asian Dragon) used in the paper.
منابع مشابه
Polyline-sourced Geodesic Voronoi Diagrams on Triangle Meshes
This paper studies the Voronoi diagrams on 2-manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point-source based GVDs, since a typical bisector contains line segments, hyperbolic segments and paraboli...
متن کاملApproximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct uniform tessellations, and therefore leads to uniform coarsening of polygonal meshes, when the output triangulation has many fewer elements than the input mesh. The mesh topology is also simplified by the clustering algo...
متن کاملMesh Coarsening based upon Multiplicatively Weighted Centroidal Voronoi Diagrams
An approximated Centroidal Voronoi Diagram (CVD) construction provides an efficient and fast way for coarsening polygonal meshes. In this article a new generalization of the CVD for 3D meshes is presented a Multiplicatively Weighted Centroidal Voronoi Diagram. Based on this concept we propose a mesh coarsening algorithm which is intended to capture the mesh features as good as possible. To achi...
متن کاملRobustness and efficiency of geometric programs: The Predicate Construction Kit (PCK)
In this article, I focus on the robustness of geometric programs (e.g., Delaunay triangulation, intersection between surfacic or volumetric meshes, Voronoi-based meshing . . . ) w.r.t. numerical degeneracies. Some of these geometric programs require “exotic” predicates, not available in standard libraries (e.g., J.-R. Shewchuk’s implementation and CGAL). I propose a complete methodology and a s...
متن کامل3B.3 Mesh Sizing with Additively Weighted Voronoi Diagrams
We address the problem of generating mesh sizing functions from a set of points with specified sizing values. The sizing functions are shown to be maximal and K-Lipschitz, with arbitrary parameter K provided by the user. These properties allow generating low complexity meshes with adjustable gradation. After constructing an additively weighted Voronoi diagram, our algorithm provides fast and ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 36 شماره
صفحات -
تاریخ انتشار 2017